#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e5 + 10;
ll a[N];
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
ll fd(ll x)
{
    ll l = 1, r = 1e9 + 10;
    while (l < r)
    {
        ll mid = (l + r) / 2;
        if (mid * (mid + 1) / 2 >= x)
        {
            r = mid;
        }
        else
        {
            l = mid + 1;
        }
    }
    return l;
}
void solve()
{
    ll n, l, r;
    cin >> n;
    cin >> l >> r;
    ll lx, ly, rx, ry;
    ll l_1 = fd(l), r_1 = fd(r);
    if (l_1 == r_1)
    {
        yes;
    }
    else if (abs(r_1 - l_1) == 1)
    {
        ll l_2 = l - (l_1 * (l_1 - 1) / 2 + 1), r_2 = r - (r_1 * (r_1 - 1) / 2 + 1);
        if (l_2 > r_2)
        {
            yes;
        }
        else
            no;
    }
    else
        no;
}
int main()
{
    ll t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}